Testing the Odd Bicycle Wheel Inequalities for the Bipartite Subgraph Polytope
نویسنده
چکیده
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.
منابع مشابه
Properties and Classification of the Wheels of the OLS Polytope
A wheel in a graph G(V, E) is an induced subgraph consisting of an odd hole and an additional node connected to all nodes of the hole. In this paper, we study the wheels of the column intersection graph of the OLS polytope (PI). These structures induce valid inequalities for this polytope, which are facet defining for its set packing relaxation. Our work builds on simple structural properties o...
متن کاملTransitive Packing: A Unifying Concept in Combinatorial Optimization
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that turn out to be special cases of the transitive packing polytope include the node packing, acyclic subdigraph, bipartite subgraph, planar subgraph, clique partitioning, par...
متن کاملGenerating Facets for the Independence System Polytope
In this paper, we present procedures to obtain facet-defining inequalities for the independence system polytope. These procedures are defined for inequalities which are not necessarily rank inequalities. We illustrate the use of these procedures by deriving strong valid inequalities for the acyclic induced subgraph, triangle free induced subgraph, bipartite induced subgraph, and knapsack polyto...
متن کاملWheel Facets of the OLS Polytope
Wheel structures of the Orthogonal Latin Squares (OLS) polytope (PI) are presented in [2]. The current work focuses on the families of valid inequalities arising from wheels and proves that certain among them are facet-defining for PI . For two of these families we provide efficient separation procedures. We also present results regarding odd-hole inequalities, which essentially form a larger c...
متن کاملFacets for the cut cone II: Clique-web inequalities
We study new classes of facets for the cut cone C, generated by the cuts of the complete graph on n vertices. This cone can also be interpreted as the cone of all semi-metrics on n points that are isometrically l~-embeddable and, in fact, the study of the facets of the cut polytope is in some sense equivalent to the study of the facets of C~. These new facets belong to the class of clique-web i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 10 شماره
صفحات -
تاریخ انتشار 1985